Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 13 matches
- 2001
- Sony Akkarakaran, P. P. Vaidyanathan:
Results on principal component filter banks: Colored noise suppression and existence issues. IEEE Trans. Inf. Theory 47(3): 1003-1020 (2001) - Sony Akkarakaran, Palghat P. Vaidyanathan:
Filterbank optimization with convex objectives and the optimality of principal component forms. IEEE Trans. Signal Process. 49(1): 100-114 (2001) - Sony Akkarakaran, P. P. Vaidyanathan:
On optimal transforms for subband domain suppression of colored noise. ICASSP 2001: 3661-3664 - Sony Akkarakaran, Palghat P. Vaidyanathan:
Discrete multitone communication with principal component filter banks. ICC 2001: 901-905 - 2000
- Sony Akkarakaran, Palghat P. Vaidyanathan:
Bifrequency and bispectrum maps: a new look at multirate systems with stochastic inputs. IEEE Trans. Signal Process. 48(3): 723-736 (2000) - Sony Akkarakaran, P. P. Vaidyanathan:
Are nonuniform principal component filter banks optimal? EUSIPCO 2000: 1-4 - P. P. Vaidyanathan, Yuan-Pei Lin, Sony Akkarakaran, See-May Phoong:
Optimizing the capacity of orthogonal and biorthogonal DMT channels. EUSIPCO 2000: 1-4 - Yuan-Pei Lin, P. P. Vaidyanathan, Sony Akkarakaran, See-May Phoong:
On the duality of optimal DMT systems and biorthogonal subband coders. ICASSP 2000: 2505-2508 - Sony Akkarakaran, Palghat P. Vaidyanathan:
Principal component filter banks: existence issues, and application to modulated filter banks. ISCAS 2000: 523-526 - Palghat P. Vaidyanathan, Yuan-Pei Lin, Sony Akkarakaran, See-May Phoong:
Optimality of principal component filter banks for discrete multitone communication systems. ISCAS 2000: 128-131 - 1999
- Sony Akkarakaran, P. P. Vaidyanathan:
New results and open problems on nonuniform filter-banks. ICASSP 1999: 1501-1504 - Sony Akkarakaran, P. P. Vaidyanathan:
The best basis problem, compaction problem and PCFB design problems [filter banks]. ISCAS (3) 1999: 508-511 - Sony Akkarakaran, P. P. Vaidyanathan:
On optimization of filter banks with denoising applications. ISCAS (3) 1999: 512-515
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-18 13:18 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint